/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 62536
 * Date: 2024-06-18
 * Time: 9:22
 */
public class Solution {
    public int maxProfit(int[] prices) {
        int n = prices.length;
        int[][] dp = new int[n][3];
        dp[0][0] = -prices[0];
        dp[0][1] = dp[0][2] = 0;
        for (int i = 1; i < n; i++) {
           dp[i][0] = Math.max(dp[i-1][1] - prices[i], dp[i-1][0]);
           dp[i][1] = Math.max(dp[i-1][1], dp[i-1][2]);
           dp[i][2] = dp[i-1][0] + prices[i];
        }

        return Math.max(dp[n-1][1], dp[n-1][2]);
    }
}
